Consensus Convolutional Sparse Coding Supplemental Material
نویسندگان
چکیده
Analogue to the ADMM method for the filter subproblem, we derive the following Algorithm 3 for solving for the sparse coefficient maps zi. However, unlike in the filter subproblem, we do not enforce consensus among the coefficient feature maps zi since there exists a distinct zi for each bi,∀i = [1 . . . N ]. In Algorithm 3, each zi update takes the form of a Tikhonov-regularized least squares problem, which has the analytical solution
منابع مشابه
Optimization Methods for Convolutional Sparse Coding
Sparse and convolutional constraints form a natural prior for many optimization problems that arise from physical processes. Detecting motifs in speech and musical passages, super-resolving images, compressing videos, and reconstructing harmonic motions can all leverage redundancies introduced by convolution. Solving problems involving sparse and convolutional constraints remains a difficult co...
متن کاملSparse Coding on Stereo Video for Object Detection
Deep Convolutional Neural Networks (DCNN) require millions of labeled training examples for image classification and object detection tasks, which restrict these models to domains where such datasets are available. In this paper, we explore the use of unsupervised sparse coding applied to stereo-video data to help alleviate the need for large amounts of labeled data. We show that replacing a ty...
متن کاملConvolutional Sparse Coding: Boundary Handling Revisited
Two different approaches have recently been proposed for boundary handling in convolutional sparse representations, avoiding potential boundary artifacts arising from the circular boundary conditions implied by the use of frequency domain solution methods by introducing a spatial mask into the convolutional sparse coding problem. In the present paper we show that, under certain circumstances, t...
متن کاملConvolutional Sparse Representations with Gradient Penalties
While convolutional sparse representations enjoy a number of useful properties, they have received limited attention for image reconstruction problems. The present paper compares the performance of block-based and convolutional sparse representations in the removal of Gaussian white noise. While the usual formulation of the convolutional sparse coding problem is slightly inferior to the block-b...
متن کامل